\begin{problem}{Waclaw}{waclaw.in}{waclaw.out}{1 second}{32 megabytes}

Waclaw Sierpinski was a Polish mathematician who liked playing with triangles.
One day he started drawing triangles using the following procedure:
\begin{itemize}
\item Draw an equilateral triangle \t{T}.
\item Connect the midpoints of its sides with line segments.
Denote the new equilateral triangles with \t{T1}, \t{T2}, \t{T3} and \t{T4}, as
illustrated in the first figure below.
\item Repeat the previous step on triangles \t{T1}, \t{T2} and \t{T3}.
New triangles are: \t{T11}, \t{T12}, \t{T13}, \t{T14}, \t{T21}, \t{T22}, \t{T23}, \t{T24}, \t{T31}, \t{T32}, \t{T33}, \t{T34}.
\item Continue the procedure on all triangles ending in 1, 2 or 3.
The resulting fractal is called the Sierpinski triangle.
\end{itemize}

\begin{center}
\includegraphics[width=9cm]{pics/waclaw.eps}
\end{center}

We say that a triangle $A$ is leaning on the triangle $B$ if $B$ does not contain
$A$ and if one entire side of $A$ is a part of some side of $B$. For example,
the triangle \t{T23} is leaning on \t{T24} and \t{T4}, but not on \t{T2} or \t{T32}.
Note that $A$ leaning on $B$ does not imply that $B$ is leaning on $A$.

Given a triangle $A$, which is a part of the Sierpinski triangle,
write a program that finds all triangles $B$ such that $A$ is leaning on $B$.

\InputFile

The first and only line of input contains a sequence of characters
representing the given triangle, as described above. The sequence
will contain between 2 and 50 characters, inclusive.

\OutputFile

Output all triangles that the given triangle is leaning on, each on a
separate line, in any order.

\Example

\begin{example}
\exmp{
T4
}{
T1
T2
T3
}%
\exmp{
T11
}{
T14
}%
\exmp{
T312
}{
T4
T314
T34
}%
\end{example}

\end{problem}
